DISCOPLAN: an Efficient On-line System for Computing Planning Domain Invariants
نویسندگان
چکیده
DISCOPLAN is an efficient system for discovering state invariants in planning domains with conditional effects. Among the types of invariants found are implicative constraints relating a fluent predication to a fluent or static predication (with allowance for static supplementary conditions), single-valuedness constraints, exclusiveness constraints, and several others. The algorithms used are polynomial-time for any fixed bound on the number of literals in an invariant. Some combinations of constraints are found by simultaneous induction, and the methods can be iterated by expanding operators using previously found invariants. The invariants found by DISCOPLAN have been shown to enable large performance gains in SAT planners, and they can also be helpful in planning domain development and debugging.
منابع مشابه
Discovering State Constraints in DISCOPLAN: Some New Results
DISCOPLAN is an implemented set of efficient preplanning algorithms intended to enable faster domain-independent planning. It includes algorithms for discovering state constraints (invariants) that have been shown to be very useful, for example, for speeding up SAT-based planning. DISCOPLAN originally discovered only certain types of implicative constraints involving up to two fluent literals a...
متن کاملNew Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups
In this paper, a new algorithm for computing secondary invariants of invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants. The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...
متن کاملAn Enhanced MSS-based checkpointing Scheme for Mobile Computing Environment
Mobile computing systems are made up of different components among which Mobile Support Stations (MSSs) play a key role. This paper proposes an efficient MSS-based non-blocking coordinated checkpointing scheme for mobile computing environment. In the scheme suggested nearly all aspects of checkpointing and their related overheads are forwarded to the MSSs and as a result the workload of Mobile ...
متن کاملImplementation of VlSI Based Image Compression Approach on Reconfigurable Computing System - A Survey
Image data require huge amounts of disk space and large bandwidths for transmission. Hence, imagecompression is necessary to reduce the amount of data required to represent a digital image. Thereforean efficient technique for image compression is highly pushed to demand. Although, lots of compressiontechniques are available, but the technique which is faster, memory efficient and simple, surely...
متن کاملIdentifying Domain Invariants from an Object-Relationship Model
Many planning algorithms require domain constraints, axioms, or invariants as a part of the domain model. This paper presents the Domain Invariant Extraction Technique (DIET) for identifying binary invariants systematically from an object-relationship domain model. The technique can be driven by an oracle (the real-world domain or a domain expert) or traces (from instructors, planners, or contr...
متن کامل